Multicolour Poisson matching

نویسندگان

چکیده

Nous considérons plusieurs processus ponctuels de Poisson indépendants sur Rd, chacun d’une couleur différente et possiblement intensité différente, nous supposons donné un ensemble type familles, étant multi-ensemble couleurs comme rouge-bleu ou rouge-rouge-bleu. étudions les stratégies invariantes par translations pour partitionner points en familles types autorisés. Ceci généralise d’appariements à une deux étudiés précédemment (où l’ensemble des autorisés sont singletons rouge-rouge rouge- bleu respectivement). caractérisons l’existence telles stratégies, ainsi que le comportement la queue distribution du diamètre famille typique. Il existe différents régimes cette dernière ; ceux-ci analogues aux cas correspondent au fait vecteur d’intensité se trouve l’intérieur frontière région d’existence, respectivement. aussi l’effet d’imposer partition soit fonction déterministe (i.e. facteur) nuage points. Dans ce cas, trouvons dimension 1. On observe nouvelle séparation régimes, déterminés propriétés algébriques

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multicolour Poisson Matching

Consider several independent Poisson point processes on Rd, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is a multiset of colours such as red-blue or red-red-green. We study translation-invariant schemes for partitioning the points into families of allowed types. This generalizes the 1-colour and 2-colour m...

متن کامل

Poisson Matching

Suppose that red and blue points occur as independent homogeneous Poisson processes in Rd. We investigate translation-invariant schemes for perfectly matching the red points to the blue points. For any such scheme in dimensions d = 1, 2, the matching distance X from a typical point to its partner must have infinite d/2-th moment, while in dimensions d ≥ 3 there exist schemes where X has finite ...

متن کامل

The Poisson Variation of Montmort's Matching Problem

Known as le probleme des rencontres, Montmort's problem has become a classic. Treated in almost every modern text on combinatorics, it has been recast in a variety of amusing guises including the random switching of n hats by a possibly tipsy cloakroom attendant, the random placement of n letters in n envelopes by a secretary apparently having a bad day, and even in terms of a wager on the orde...

متن کامل

On Compound Poisson Approximation For Sequence Matching

Consider the sequences fX i g m i=1 and fY i g n j=1 of independent random variables , which take values in a nite alphabet, and assume that the variables X 1 ; X 2 ; : : : and Y 1 ; Y 2 ; : : : follow the distributions and , respectively. Two variables X i and Y j are said to match if X i = Y j. Let the number of matching subsequences of length k between the two sequences, when r, 0 r < k, mis...

متن کامل

Multicolour Turán problems

A simple k-colouring of a multigraph G is a decomposition of the edge multiset as the sum of k simple graphs, called ‘colours’. A copy of some fixed graph H in G is called multicoloured if its edges all have distinct colours. Recall that the Turán number ex(n,H) of H is the maximum number of edges in a graph on n vertices not containing a copy of H . We consider a multicolour generalisation exk...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales de l'I.H.P

سال: 2021

ISSN: ['0246-0203', '1778-7017']

DOI: https://doi.org/10.1214/21-aihp1147